- 1 - Encoding The ATMS In AGM Logic ( Revised )
نویسنده
چکیده
The two main theories of justification are the foundational theory and the coherence theory. We choose as representatives of these two theories the ATMS [de Kleer 1986] and the AGM logic [Gärdenfors 1988a], and show that it is possible to simulate the ATMS in the AGM logic by encoding the justificational information as epistemic entrenchments. The ATMS context changes are performed by AGM expansion and contraction operations. The algorithm for calculating these entrenchments is presented, followed by a proof that the AGM logic with these entrenchments is behaviourally equivalent to the ATMS.
منابع مشابه
Connections Between the ATMS and AGM Belief Revision
The Assumption-based Truth Maintenance System (ATMS) [de Kleer, 1986] is the most wel l known implementation of any dynamic reasoning system. Some connections have been established between the A T M S and various nonmonotonic logics (e.g. autoepistemic logic [Reinfrank et al., 1989]). We describe the relationship between the A T M S and the A G M logic of belief [Gardenfors, 1988], and show tha...
متن کاملBelief Revision: A Computational Approach
In order to reason about the real world, intelligent systems must have ways of dealing with incomplete and inconsistent information. This issue is addressed in the study of nonmonotonic reasoning, truth maintenance and database update. Belief revision is a formal approach which is central to these areas. This thesis describes a computational approach to the logic of belief revision developed by...
متن کاملThe Algebra of Multi-Agent Dynamic Belief Revision
We refine our algebraic axiomatization in [8, 9] of epistemic actions and epistemic update (notions defined in [5, 6] using a relational, Kripke-style semantics), to incorporate a mechanism for dynamic belief revision in a multi-agent setting. Our approach has a number of novel features, when compared with traditional belief revision systems such as AGM [2]. Firstly: while traditional belief re...
متن کاملAn Efficient ATMS for Equivalence Relations
We introduce a specialized ATMS for efficiently computing equivalence relations in multiple contexts. This specialized ATMS overcomes the problems with existing solutions to reasoning with equivalence relations. The most direct implementation of an equivalence relation in the ATMS-encoding the reflexive, transitive and symmetric rules in the consumer architectureproduces redundant equality deri...
متن کاملNORTH- HOLLAND A Generic ATMS*
The main aim of this paper is to create a general truth maintenance system based on the De Kleer algorithm. This system (the ATMS) is to be designed so that it can be used in different propositional monotonic logic models of reasoning systems. The knowledge base system that will interact with it is described. Furthermore, we study the efficiency that transferring the ATMS to a logic with severa...
متن کامل